Propositional dynamic logic for searching games with errors
نویسندگان
چکیده
منابع مشابه
Propositional dynamic logic for searching games with errors
We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the n+ 1valued Kripke models and a corresponding language based on a modal extension of Łukasiewicz many-valued logic. We illustrate the definitions by providing a framework for an analysis of the Rényi Ulam searching game with errors. Our main result is the axiomatization of t...
متن کاملPartiality and Games: Propositional Logic
We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen to be motivated from a game-theoretic p...
متن کاملGeneralizing Propositional Dynamic Logic
A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...
متن کاملPropositional Dynamic Logic with Program Quantifiers
We consider an extension QPDL of Segerberg-Pratt’s Propositional Dynamic Logic PDL, with program quantification, and study its expressive power and complexity. A mild form of program quantification is obtained in the calculus μPDL, extending PDL with recursive procedures (i.e. context free programs), which is known to be Π 1 -complete. The unrestricted program quantification we consider leads t...
متن کاملPropositional dynamic logic with Belnapian truth values
We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (‘Modal logics with Belnapian truth values’, J. Appl. Non-Class. Log. 20, 279–301 (2010)). We modify the standard arguments based on canonical models and filtration to suit the four-valued context and prove weak completeness and decidability of BPDL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2014
ISSN: 1570-8683
DOI: 10.1016/j.jal.2014.04.001